Papers with test-time adaptation

14 papers
Test-time Adaptation for Machine Translation Evaluation by Uncertainty Minimization (2023.acl-long)

Copied to clipboard

Challenge: evaluators of machine translation systems often use text-based metrics to evaluate performance . however, these metrics lack semantic-level information and exhibit poor correlation with human ratings . authors propose a method to reduce inference bias of neural metrics in out-of-distribution data .
Approach: They propose to reduce inference bias by using uncertainty estimation, test-time adaptation, and inference to reduce model uncertainty.
Outcome: The proposed method reduces model uncertainty and improves correlation performance across models.
CTTA-T: Continual Test-Time Adaptation for Text Understanding via Teacher-Student with a Domain-aware and Generalized Teacher (2026.acl-long)

Copied to clipboard

Challenge: Existing models for text understanding fail to adapt to domain shifts in real-world applications . current models do not improve themselves as they are applied to new domains .
Approach: They propose a continual test-time adaptation framework that adapts to evolving domains . they propose accumulating domains and a refine-then-filter framework to calibrate teacher predictions .
Outcome: The proposed model excels in a teacher-student framework adaptable to evolving domains.
AdaRewriter: Unleashing the Power of Prompting-based Conversational Query Reformulation via Test-Time Adaptation (2025.emnlp-main)

Copied to clipboard

Challenge: Prompting-based conversational query reformulation has emerged as a powerful approach for conversational search, refining ambiguous user queries into standalone search queries.
Approach: They propose a framework for query reformulation using an outcome-supervised reward model via test-time adaptation.
Outcome: Experiments on five conversational search datasets show that AdaRewriter significantly outperforms the existing methods across most settings.
From Implicit Graph Encoding to Explicit Evidence: A Training-Free LLM Framework for Temporal Knowledge Graph Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing Large Language Models (LLMs) struggle with implicit modality alignment and suboptimal graph linearization.
Approach: They propose a training-free, test-time adaptive framework that reframes TKG prediction as explicit evidence-driven reasoning.
Outcome: ExE-LLM outperforms fully trained graph neural networks on four benchmarks . it achieves SOTA performance in inductive settings, significantly outperforming fully trained neural networks .
Effective Large Language Model Adaptation for Improved Grounding and Citation Generation (2024.naacl-long)

Copied to clipboard

Challenge: Large language models generate "hallucinated" answers that are not factual . despite their widespread adoption, they can generate plausiblesounding but nonfactual information.
Approach: They propose a framework that tunes large language models to self-ground claims and provide citations to retrieved documents.
Outcome: The proposed framework generates superior grounded responses with more accurate citations compared to prompting-based approaches and post-hoc citing-based methods.
Robust Question Answering against Distribution Shifts with Test-Time Adaption: An Empirical Study (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing work on robustness tuning (RT) methods has found that QA models fail when the test data has a distribution shift compared to the training data.
Approach: They propose to use test-time adaptation methods to improve QA models after deployment to evaluate their model against text corruption and changes in language and domain.
Outcome: The proposed method improves TTA to be more robust to variation in hyper-parameters and test distributions over time.
Beware of Model Collapse! Fast and Stable Test-time Adaptation for Robust Question Answering (2023.emnlp-main)

Copied to clipboard

Challenge: Pre-trained language models (PLMs) have achieved great success in question answering, but their robustness is insufficient to support their practical applications.
Approach: They propose a method which regularizes the model's output and an efficient side block to reduce its inference time.
Outcome: The proposed method achieves comparable or better results than previous TTA methods at a speed close to vanilla forward propagation, which is 1.8 to 4.4 speedup compared to previous methods.
MedAdapter: Efficient Test-Time Adaptation of Large Language Models Towards Medical Reasoning (2024.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have improved generation and reasoning capabilities compared to traditional BERT-sized models due to massive number of parameters and extensive pre-training on vast textual corpora.
Approach: They propose a unified post-hoc adapter for test-time adaptation of large language models . they propose to fine-tune only a small BERT-sized adapter to rank candidate LLMs .
Outcome: The proposed adapter improves performance on four biomedical tasks without requiring computational resources or sharing data with third parties.
STAF: Pushing the Boundaries of Test-Time Adaptation towards Practical Noise Scenarios (2024.lrec-main)

Copied to clipboard

Challenge: Pre-trained language models have demonstrated superior performance on NLP tasks . however, when the training domain and testing domain are taken from different distributions, the deployed model often violates this assumption.
Approach: They propose a Stable Test-time Adaptation Framework to stabilize the adaptation process.
Outcome: The proposed framework boosts model robustness to noise distribution shifts while minimizing error accumulation and catastrophic forgetting.
Gated Differentiable Working Memory for Long-Context Language Modeling (2026.acl-long)

Copied to clipboard

Challenge: Long contexts break transformers, attention scores dilute, model cannot adapt to novel patterns at inference time.
Approach: They propose a framework that gates the memory consolidation process by estimating Contextual Utility . they propose GDWM to maintain a form of working memory with constant contexts .
Outcome: The proposed framework achieves comparable or superior performance on sparse-information tasks with 4 fewer gradient steps compared to uniform baselines.
Training-Free Test-Time Contrastive Learning for Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing training-free alternatives to training-based models are static or depend on external guidance.
Approach: They propose a training-free adaptation framework that enables a frozen LLM to improve online by distilling supervision from its own inference experiences.
Outcome: The proposed framework outperforms existing test-time adaptation methods under online evaluation.
TTVS: Boosting Self-Exploring Reinforcement Learning via Test-time Variational Synthesis (2026.findings-acl)

Copied to clipboard

Challenge: Existing test-time methods are limited in specialized or novel domains where supervision is prohibitively expensive or unavailable.
Approach: They propose a framework that augments training stream from unlabeled test queries.
Outcome: Extensive experiments show TTVS outperforms state-of-the-art RL-based techniques on unlabeled test-time data.
DANCE: Diversity-attended Dynamic Caching with Asymmetric Quantization for Test-time Adaptation of Vision-Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to test-time adaptation of vision-language models measure prediction entropy but these samples tend to approach prototypes with limited coverage of data distributions.
Approach: They propose a new approach for test-time adaptation of vision-language models . they construct a dynamic cache to store diversity-aware test samples .
Outcome: The proposed approach is more efficient than current methods on augmented visual models.
Mem-Gallery: Benchmarking Multimodal Long-Term Conversational Memory for MLLM Agents (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks evaluate multi-session memory in text-only conversations or assess multimodal understanding within localized contexts.
Approach: They propose a benchmark for evaluating multimodal long-term conversational memory in MLLM agents.
Outcome: The proposed framework assesses key memory capabilities along three functional dimensions: memory extraction and test-time adaptation, memory reasoning, and memory knowledge management.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations